class Solution
{
public:
    bool IsContinuous(vector<int>& numbers)
    {
        sort(numbers.begin(), numbers.end());

        int king_nums = 0;
        int i = 0;
        while (numbers[i] == 0)
        {
            king_nums++;
            i++;
        }
        if (king_nums == 4) return true;

        int j = i;
        while (j < numbers.size())
        {
            if (numbers[j] == numbers[j - 1])
                return false;
            j++;
        }

        return numbers.back() - numbers[i] < 5;
    }
};